Associative reinforcement learning: A generate and test algorithm
نویسندگان
چکیده
منابع مشابه
PAC Associative Reinforcement Learning
General algorithms for the reinforcement learning problem typically learn policies in the form of a table that directly maps the states of the environment into actions. When the state-space is large these methods become impractical. One approach to increase e ciency is to restrict the class of policies by considering only policies that can be described using some xed representation. This paper ...
متن کاملEvaluating a Reinforcement Learning Algorithm with a General Intelligence Test
In this paper we apply the recent notion of anytime universal intelligence tests to the evaluation of a popular reinforcement learning algorithm, Q-learning. We show that a general approach to intelligence evaluation of AI algorithms is feasible. This top-down (theory-derived) approach is based on a generation of environments under a Solomonoff universal distribution instead of using a pre-defi...
متن کاملReinforcement Learning in Associative Memory
A reinforcement learning based associative memory structure (RLAM) is proposed. In this structure, a one-layer feed forward Palm [1] model is applied to the networks. Instead of batch training, an on-line learning method is used to construct the memory. The networks are trained interactively according to reinforcement learning, which is biologically plausible. The experiment results show that t...
متن کاملA Reinforcement Learning Agent with Associative Perception
One of the most perspective ideas of further development of Reinforcement Learning (RL) research involves using associative learning models to improve performance of reinforcement learning agents. Learning Classifier Systems (LCS) have proved to be one of the most successful classes of RL methods that have been applied to maze environments. However, so far LCS have shown their effectiveness for...
متن کاملAssociative Reinforcement Learning of Real-valued Functions
|Associative reinforcement learning (ARL) tasks de ned originally by Barto and Anandan [1] combine elements of problems involving optimization under uncertainty, studied by learning automata theorists, and supervised learning pattern-classi cation. The stochastic real-valued (SRV) unit algorithm [6] has been designed for an extended version of ARL tasks wherein the learning system's outputs can...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Machine Learning
سال: 1994
ISSN: 0885-6125,1573-0565
DOI: 10.1007/bf00993348